منابع مشابه
On Embedding a Cycle in a Plane Graph
Consider a planar drawing Γ of a planar graph G such that the vertices are drawn as small circles and the edges are drawn as thin strips. Consider a cycle c of G. Is it possible to draw c as a non-intersecting closed curve inside Γ, following the circles that correspond in Γ to the vertices of c and the strips that connect them? We show that this test can be done in polynomial time and study th...
متن کاملa study on rate making and required reserves determination in reinsurance market: a simulation
reinsurance is widely recognized as an important instrument in the capital management of an insurance company as well as its risk management tool. this thesis is intended to determine premium rates for different types of reinsurance policies. also, given the fact that the reinsurance coverage of every company depends upon its reserves, so different types of reserves and the method of their calc...
Graph Embedding with Topological Cycle-Constraints
This paper concerns graph embedding under topological constraints. We address the problem of nding a planar embedding of a graph satisfying a set of constraints between its vertices and cycles that require embedding a given vertex inside its corresponding cycle. This problem turns out to be NP-complete. However, towards an analysis of its tractable subproblems, we develop an eecient algorithm f...
متن کاملOn Embedding a Qualitative Representation in a Two-Dimensional Plane
This paper discusses embedding in a two-dimensional plane a symbolic representation for spatial data using the simple objects, points(P ), lines(L), circuits(C) and areas(A). We have proposed PLCA as a new framework for a qualitative spatial reasoning. In a PLCA expression, the entire figure is represented in a form in which all the objects are related. We investigate the conditions for two-dim...
متن کاملRe-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.090